Efficient Task Collaboration with Execution Uncertainty

نویسندگان

  • Dengji Zhao
  • Sarvapali D. Ramchurn
  • Nicholas R. Jennings
چکیده

We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account. We show that this can be achieved by using the post-execution verification (PEV)-based mechanism if and only if agents’ valuations satisfy a multilinearity condition. We then consider a more complex setting where an agent’s execution uncertainty is not completely predictable by the agent alone but aggregated from all agents’ private opinions (known as trust). We show that PEV-based mechanism with trust is still truthfully implementable if and only if the trust aggregation is multilinear.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space-based Task Allocation in Robotic Fleets with Adaptive Autonomy

Networked robotic fleet consists of multiple robots with heterogeneous capabilities that jointly perform a mission. Due to the ability to distribute heterogeneous robots in a working environment and exploit their cooperation and collaboration capacities, it has been shown that utilizing a robotic fleet for accomplishing a given mission is faster and more efficient than using a single robot. Now...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Mechanism Design with Execution Uncertainty

We introduce the notion of fault tolerant mechanism design, which extends the standard game theoretic framework of mechanism design to allow for uncertainty about execution. Specifically, we define the problem of task allocation in which the private information of the agents is not only their costs to attempt the tasks, but also their probabilities of failure. For several different instances of...

متن کامل

Planning, Execution and Sensor-Based Reaction for Assembly Robotic Tasks

This paper deals with the implementation of an Intelligent Assembly Robotic System incorporating an interface with Computer Vision, an efficient Task Planning methodology and the execution of the planned task by a robot manipulator. Sensing capabilities are also used during task execution. The approach to Task Planning we are using is really very efficient, namely due to the choice of good heur...

متن کامل

Fault Tolerant Mechanism Design for General Task Allocation

We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account (i.e., fault tolerant). To achieve this, we show that the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1509.05181  شماره 

صفحات  -

تاریخ انتشار 2015